Representing Simplicial Complexes with Mangroves
نویسندگان
چکیده
Simplicial complexes are extensively used for discretizing digital shapes in two, three, and higher dimensions within a variety of application domains. There have been many proposals of topological data structures, which represent the connectivity information among simplices. We introduce the Mangrove Topological Data Structure (Mangrove TDS) framework, a tool which supports the efficient implementation of data structures for simplicial complexes of any dimension under the same application interface. Our framework is based on a graph-based representation of connectivity relations, that we call the mangrove. It can be customized in order to simulate the content of any topological data structure with a negligible overhead. Thus, the Mangrove TDS framework is extensible, and supports the most diverse modeling needs. We also provide implicit representations of those simplices, which are not directly encoded in a specific topological data structure. Our tests show that these representations, that we call ghost simplices, improve the expressive power and the efficiency of topological queries. In order to prove the validity of our approach, we design two topological data structures, specific for non-manifold complexes, within our framework. We perform comparisons with some widely-used representations in the literature as well as with libraries available in the public domain.
منابع مشابه
Vertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملCohen-Macaulay-ness in codimension for simplicial complexes and expansion functor
In this paper we show that expansion of a Buchsbaum simplicial complex is $CM_t$, for an optimal integer $tgeq 1$. Also, by imposing extra assumptions on a $CM_t$ simplicial complex, we provethat it can be obtained from a Buchsbaum complex.
متن کاملA Representation for Abstract Simplicial Complexes: An Analysis and a Comparison
Abstract simplicial complexes are used in many application contexts to represent multi-dimensional, possibly non-manifold and nonuniformly dimensional, geometric objects. In this paper we introduce a new general yet compact data structure for representing simplicial complexes, which is based on a decomposition approach that we have presented in our previous work [3]. We compare our data structu...
متن کامل